C4-factorizations with two associate classes, λ1 is odd
نویسندگان
چکیده
Let K = K(a, p;λ1, λ2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. This graph was of interest to Bose and Shimamoto in their study of group divisible designs with two associate classes. Necessary and sufficient conditions for the existence of z-cycle decompositions of this graph have been found when z ∈ {3, 4}. The existence of C4-factorizations of K has been settled when a is even, and when a ≡ 1(mod 4) and λ1 is even. In this paper, necessary and sufficient conditions for the existence of a C4-factorization of K(a, p;λ1, λ2) are found when a ≡ 1(mod 4) and λ1 is odd with one possible exception.
منابع مشابه
C4-factorizations with two associate classes
C. A. Rodger, M. A. Tiemeyer∗, Auburn University Let K = K(a, p;λ1, λ2) be the multigraph with: the number of vertices in each part equal to a; the number of parts equal to p; the number of edges joining any two vertices of the same part equal to λ1; and the number of edges joining any two vertices of different parts equal to λ2. This graph was of interest to Bose and Shimamoto in their study o...
متن کاملGroup Divisible Designs with Two Associate Classes and with Two Unequal Groups
A group divisible design GDD(m,n; 3, λ1, λ2) is an ordered triple (V,G,B), where V is a m+ n-set of symbols, G is a partition of V into 2 sets of sizes m,n, each set being called group, and B is a collection of 3-subsets (called blocks) of V , such that each pair of symbols from the same group occurs in exactly λ1 blocks; and each pair of symbols from different groups occurs in exactly λ2 block...
متن کاملGDDs with two associate classes and with three groups of sizes 1, n and n
A group divisible design GDD(5, n, n; 3, λ1, λ2) is an ordered triple (V,G,B), where V is a 5 + n + n-set of symbols, G is a partition of V into 3 sets of sizes 5, n, n, each set being called group, and B is a collection of 3-subsets (called blocks) of V , such that each pair of symbols from the same group occurs in exactly λ1 blocks; and each pair of symbols from different groups occurs in exa...
متن کاملExcessive near 1-factorizations
We begin the study of sets of near 1-factors of graphs G of odd order whose union contains all the edges of G and determine, for a few classes of graphs, the minimum number of near 1-factors in such sets. MSC 2000: Primary 05C70; Secondary 05C15.
متن کاملA Giambelli Formula for Isotropic Grassmannians
LetX be a symplectic or odd orthogonal Grassmannian parametrizing isotropic subspaces in a vector space equipped with a nondegenerate (skew) symmetric form. We prove a Giambelli formula which expresses an arbitrary Schubert class in H∗(X,Z) as a polynomial in certain special Schubert classes. We introduce and study theta polynomials, a family of polynomials which are positive linear combination...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 50 شماره
صفحات -
تاریخ انتشار 2011